Counting Parallel Segments: New Variants of Pick’s Area Theorem
نویسندگان
چکیده
منابع مشابه
Quantitative Counting with Bayes Theorem
Given a dataset generated by various processes, an estimate of the quantity of data points associated with each generation process can be achieved using a probabilistic count of evidence using Bayes Theorem. However, the usefulness of these counts is limited by the presence of uncertainties stemming from the determination of quantities using maximum likelihood and the imprecision of density est...
متن کاملOn intersecting a set of parallel line segments with a convex polygon of minimum area
Let S = {l1, l2, l3, . . . , ln} be a set of n vertical line segments in the plane. Though not essential, to simplify proofs we assume that no two li’s are on the same vertical line. A convex polygon weakly intersects S if it contains a point of each line segment on its boundary or interior. In this paper, we propose an O(n log n) algorithm for the problem of finding a minimum area convex polyg...
متن کاملParallel frequent set counting
Computing the frequent subsets of large multi-attribute data is both computationand data-intensive. The standard parallel algorithms require multiple passes through the data. The cost of data access may easily outweigh any performance gained by parallelizing the computational part. We address three opportunities for performance improvement: using an approximate algorithm that requires only a si...
متن کاملVariants of Karamata’s Iteration Theorem
Karamata’s Iteration Theorem is used to refine the asymptotic behavior of iterates of a function, under a more restrictive assumption than Karamata’s, but still involving regular variation. A second result gives a necessary and sufficient integral condition for convergence of a series of iterates. Historical background to the idea of regularly varying sequence precedes a short concluding sectio...
متن کاملNew Deterministic Algorithms for Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching
We describe a new method for decomposing planar sets of segments and points. Using this method we obtain new efficient deterministic algorithms for counting pairs of intersecting segments, and for answering off-line triangle rang'e queries. In particular we obtain the following results: (1) Given n segments in the plane, the number K of pairs of intersecting segments is computed in time O(nl+ f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Mathematical Intelligencer
سال: 2019
ISSN: 0343-6993,1866-7414
DOI: 10.1007/s00283-019-09921-8